Multi-level parallel chaotic Jaya optimization algorithms for solving constrained engineering design problems

نویسندگان

چکیده

Several heuristic optimization algorithms have been applied to solve engineering problems. Most of these are based on populations that evolve according different rules and parameters reach the optimal value a function cost through an iterative process. Different parallel strategies proposed accelerate algorithms. In this work, we combined coarse-grained strategies, multi-populations, with fine-grained diffusion grid, efficiently use large number processes, thus drastically decreasing computing time. The Chaotic Jaya algorithm has considered in work due its good computational behaviors solving both constrained problems (seven problems) unconstrained benchmark functions (a set 18 functions). experimental results show outperform state-of-the-art terms behavior, quality obtained solutions, exploit shared memory platforms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

متن کامل

Constrained Multi-Objective Optimization Problems in Mechanical Engineering Design Using Bees Algorithm

Many real-world search and optimization problems involve inequality and/or equality constraints and are thus posed as constrained optimization problems. In trying to solve constrained optimization problems using classical optimization methods, this paper presents a Multi-Objective Bees Algorithm (MOBA) for solving the multi-objective optimal of mechanical engineering problems design. In the pre...

متن کامل

FOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems

These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...

متن کامل

Unified Particle Swarm Optimization for Solving Constrained Engineering Optimization Problems

We investigate the performance of the recently proposed Unified Particle Swarm Optimization method on constrained engineering optimization problems. For this purpose, a penalty function approach is employed and the algorithm is modified to preserve feasibility of the encountered solutions. The algorithm is illustrated on four well–known engineering problems with promising results. Comparisons w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Supercomputing

سال: 2021

ISSN: ['0920-8542', '1573-0484']

DOI: https://doi.org/10.1007/s11227-021-03737-0